Primitive Geometric Operations on Planar Algebraic Curves with Gaussian Approximations
نویسندگان
چکیده
We present a curve approximation method which approximates each planar algebraic curve segment by discrete curve points at each of which the curve has its gradient from a set of uniformly distributed normals. This method, called Gaussian Approximation (GAP), provides eecient algorithms for various primitive geometric operations, especially for those related with gradients such as common tangent and convolution computations, on planar algebraic curve segments. The hierarchy of unit gradients gives the corresponding hierarchy of GAP. The approximation error at each level of the hierarchy can be modeled in the representation of GAP itself, and we can use this structure to dynamically control the precision and eeciency of geometric computation with GAP. We implemented various primitive geometric operations on planar algebraic curve segments with GAP representations on SUN4/Sparc station using C.
منابع مشابه
Gaussian Approximations of Objects Bounded by Algebraic Curves
We present a discrete approximation method for planar algebraic curves. This discrete approximation is hierarchical, curvature dependent, and provides eecient algorithms for various primitive geometric operations on algebraic curves. We consider applications on the curve intersections , the distance computations, and the common tangent and convolution computations. We implemented these approxim...
متن کاملPrimitive Geometric Operations on Planar Algebraic Curves with Gaussian Approximation
We present a curve approximation method which approximates each planar algebraic curve segment by discrete curve points at each of which the curve has its gradient from a set of uniformly distributed normals. This method, called Gaussian Approximation (GAP), provides efficient algorithms for various primitive geometric operations, especially for those related with gradients such as common tange...
متن کاملPlanar shape manipulation using approximate geometric primitives
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is O(n log n + k) for an input of size n with k = O(n) consistency violations. The output is as accurate as the geometric primitives. We validate our algorithms in flo...
متن کاملSpline Approximations of Real Algebraic Surfaces
We use a combination of both symbolic and numerical techniques to construct several degree bounded G0 and G1 continuous, piecewise spline approximations of real implicit algebraic surfaces for both computer graphics and geometric modeling. These approximations are based upon an adaptive triangulation (a G0 planar approximation) of the real components of the algebraic surface, and include both s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992